On the Discrete Functions with given Essential Arity Gap
نویسنده
چکیده
In the paper the n−ary k−valued functions (k > 2) on a finite set of k elements with essential arity gap equal to p, p ≤ k are investigated. We give a formula (term-presentation of the functions which have given essential arity gap. This representation is based on the operation tables of the functions in their SC-forms as sums of conjunctions. The combinatorial problem how many there are k−valued functions depending essentially on all of its n variables which have arity gap p, 2 < p ≤ n ≤ k is solved, also.
منابع مشابه
Essential arity gap of Boolean functions
In this paper we investigate the Boolean functions with essential arity gap 2. We use Full Conjunctive Normal Forms instead of Zhegalkin’s polynomials, which allow us to simplify the proofs and to obtain several combinatorial results, concerning the Boolean functions with a given arity gap.
متن کاملEssential Arity Gap of k-Valued Functions
We investigate k−valued functions on a finite set of k elements with essential arity gap ≤ k. We describe the functions which have maximal arity gap. This description is based on the representation of the functions in their full conjunctive normal form. The combinatorial problem how many there are k−valued functions which have arity gap k is solved, also.
متن کاملOn the Arity Gap of Finite Functions: Results and Applications
Let A be a finite set and B an arbitrary set with at least two elements. The arity gap of a function f : An → B is the minimum decrease in the number of essential variables when essential variables of f are identified. A non-trivial fact is that the arity gap of such B-valued functions on A is at most |A|. Even less trivial to verify is the fact that the arity gap of B-valued functions on A wit...
متن کاملOn finite functions with non-trivial arity gap
Given an n-ary k-valued function f , gap(f) denotes the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f . We particularly solve a problem concerning the explicit determination of n-ary k-valued functions f with 2 ≤ gap(f) ≤ n ≤ k. Our methods yield new combinatorial results about the number of such functions.
متن کاملFinite symmetric functions with non-trivial arity gap
Given an n-ary k−valued function f , gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f . The class G p,k of all n-ary k−valued functions f with 2 ≤ gap(f) is explicitly determined by the authors and R. Willard in [5, 7, 8]. We prove that if f ∈ G p,k is a symmetric f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009